package main

import "fmt"

func main(){
	fmt.Println(quickSort([]int{2,3,1,20,10}))
}

func quickSort(data []int)(arr []int){
	length := len(data)
	if length < 1{
		return
	}
	base := data[0]
	befor := make(map[int]int)
	after := make(map[int]int)
	for i := 0;i < length;i++{
		if data[i] > base{
			after[len(after)-1] = data[i]
		}else{
			befor[len(befor)-1] = data[i]
		}
	}
	return data
}